Strictly Order Primal Algebras
نویسنده
چکیده
Partial orders and the clones of functions preserving them have been thoroughly studied in recent years. The topic of this papers is strict orders which are irreflexive, asymmetric and transitive subrelations of partial orders. We call an algebra A = (A,Ω) strictly order primal if for some strict order (A,<) the term functions are precisely the functions which preserve this strict order. Our approach has some parallels to the theory of order primal algebras [8], [2]. We present new examples of congruence distributive varieties and of strict orders without near unanimity operations. Then we give a series of new examples showing that there are varieties which are (n + 1)-permutable but not n-permutable. Furthermore the dual category of strict chains is described by the methods from B. Davey and H. Werner [3]. Throughout we use the notations of Grätzer [4] and assume a knowledge of Davey-Werner [3] for the last section.
منابع مشابه
Primal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملPrimal-dual algorithms and infinite-dimensional Jordan algebras of finite rank
We consider primal-dual algorithms for certain types of infinite-dimensional optimization problems. Our approach is based on the generalization of the technique of finite-dimensional Euclidean Jordan algebras to the case of infinite-dimensional JB-algebras of finite rank. This generalization enables us to develop polynomial-time primal-dual algorithms for “infinite-dimensional second-order cone...
متن کاملA Method to Translate Order-Sorted Algebras to Many-Sorted Algebras
Order-sorted algebras and many sorted algebras exist in a long history with many different implementations and applications. A lot of language specifications have been defined in order-sorted algebra frameworks such as the language specifications in K (an order-sorted algebra framework). The biggest problem in a lot of the order-sorted algebra frameworks is that even if they might allow develop...
متن کاملJónsson posets and unary Jónsson algebras
We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than |P |, and κ is a cardinal number strictly less than |P |, then P has a principal order ideal of cardinality at least κ. We apply this result to characterize the possible sizes of unary Jónsson algebras.
متن کاملHu’s Primal Algebra Theorem revisited
It is shown how Lawvere’s one-to-one translation between Birkhoff’s description of varieties and the categorical one (see [6]) turns Hu’s theorem on varieties generated by a primal algebra (see [4], [5]) into a simple reformulation of the classical representation theorem of finite Boolean algebras as powerset algebras.
متن کامل